0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n043.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:37:39 CST 2018
0.00/0.21	% done 4 iterations in 0.004s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff('thm/arith/SUC_SUB1_', axiom,
0.00/0.21	  (![A:'type/nums/num']:
0.00/0.21	     ('const/arith/-'('const/nums/SUC'(A),
0.00/0.21	                      'const/nums/NUMERAL'('const/nums/BIT1'('const/nums/_0'))) =
0.00/0.21	      A))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X0 : 'type/nums/num']:
0.00/0.21	      'const/arith/-'('const/nums/SUC'(X0), 
0.00/0.21	        'const/nums/NUMERAL'('const/nums/BIT1'('const/nums/_0')))
0.00/0.21	       = X0,
0.00/0.21	    inference('cnf', [status(esa)], [thm/arith/SUC_SUB1_])).
0.00/0.21	tff('thm/iterate/NUMSEG_RREC_', axiom,
0.00/0.21	  (![A:'type/nums/num',A0:'type/nums/num']:
0.00/0.21	     ('const/arith/<='(A,A0) =>
0.00/0.21	      ('const/sets/INSERT'('type/nums/num',A0,
0.00/0.21	                           'const/iterate/..'(A,
0.00/0.21	                                              'const/arith/-'(A0,
0.00/0.21	                                                              'const/nums/NUMERAL'(
0.00/0.21	                                                              'const/nums/BIT1'(
0.00/0.21	                                                              'const/nums/_0'))))) =
0.00/0.21	       'const/iterate/..'(A,A0))))).
0.00/0.21	tff('1', plain,
0.00/0.21	    ![X1 : 'type/nums/num', X2 : 'type/nums/num']:
0.00/0.21	      ('const/sets/INSERT'('type/nums/num', X2, 
0.00/0.21	         'const/iterate/..'(X1, 
0.00/0.21	           'const/arith/-'(X2, 
0.00/0.21	             'const/nums/NUMERAL'('const/nums/BIT1'('const/nums/_0')))))
0.00/0.21	        = 'const/iterate/..'(X1, X2)
0.00/0.21	       | ~ 'const/arith/<='(X1, X2)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/iterate/NUMSEG_RREC_])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X0 : 'type/nums/num', X1 : 'type/nums/num']:
0.00/0.21	      ('const/sets/INSERT'('type/nums/num', 'const/nums/SUC'(X0), 
0.00/0.21	         'const/iterate/..'(X1, X0))
0.00/0.21	        = 'const/iterate/..'(X1, 'const/nums/SUC'(X0))
0.00/0.21	       | ~ 'const/arith/<='(X1, 'const/nums/SUC'(X0))),
0.00/0.21	    inference('sup+', [status(thm)], ['0', '1'])).
0.00/0.21	tff('thm/iterate/NUMSEG_REC_', conjecture,
0.00/0.21	  (![A:'type/nums/num',A0:'type/nums/num']:
0.00/0.21	     ('const/arith/<='(A,'const/nums/SUC'(A0)) =>
0.00/0.21	      ('const/iterate/..'(A,'const/nums/SUC'(A0)) =
0.00/0.21	       'const/sets/INSERT'('type/nums/num','const/nums/SUC'(A0),
0.00/0.21	                           'const/iterate/..'(A,A0)))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (![A:'type/nums/num',A0:'type/nums/num']:
0.00/0.21	       ('const/arith/<='(A,'const/nums/SUC'(A0)) =>
0.00/0.21	        ('const/iterate/..'(A,'const/nums/SUC'(A0)) =
0.00/0.21	         'const/sets/INSERT'('type/nums/num','const/nums/SUC'(A0),
0.00/0.21	                             'const/iterate/..'(A,A0))))))).
0.00/0.21	tff('3', plain,
0.00/0.21	    'const/iterate/..'(sk_A, 'const/nums/SUC'(sk_A0))
0.00/0.21	     != 'const/sets/INSERT'('type/nums/num', 'const/nums/SUC'(sk_A0), 
0.00/0.21	          'const/iterate/..'(sk_A, sk_A0)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('4', plain,
0.00/0.21	    ('const/iterate/..'(sk_A, 'const/nums/SUC'(sk_A0))
0.00/0.21	      != 'const/iterate/..'(sk_A, 'const/nums/SUC'(sk_A0))
0.00/0.21	     | ~ 'const/arith/<='(sk_A, 'const/nums/SUC'(sk_A0))),
0.00/0.21	    inference('sup-', [status(thm)], ['2', '3'])).
0.00/0.21	tff('5', plain, 'const/arith/<='(sk_A, 'const/nums/SUC'(sk_A0)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ('const/iterate/..'(sk_A, 'const/nums/SUC'(sk_A0))
0.00/0.21	      != 'const/iterate/..'(sk_A, 'const/nums/SUC'(sk_A0))
0.00/0.21	     | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.21	tff('7', plain, $false, inference('simplify', [status(thm)], ['6'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
